﻿/**	\file		std_map.hpp
*	\date		(2007-07-02 02:21:39)/(2008-08-11 03:18:49)
*-----------------------------------------------------------------------------
*	\version	1.0.4.4
*	\author		Nick Shallery	(nicknide@gmail.com)
*	\copyright	YOU HAVE ALL LEFT WITH THIS CODE WHILE YOU KEEP COMMENT IN EVERY COPY.
*-----------------------------------------------------------------------------
**/

/*
 *
 * Copyright (c) 1994
 * Hewlett-Packard Company
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Hewlett-Packard Company makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 *
 *
 * Copyright (c) 1996,1997
 * Silicon Graphics Computer Systems, Inc.
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Silicon Graphics makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 *
 *
 * Copyleft (c) 2007
 * Nick Shallery @ LoliX.Lib
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Nick Shallery makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 *
 */


#if			!defined(__LOLIX__TOY__STD_MAP__NICK__K_IN_G__)
#define		__LOLIX__TOY__STD_MAP__NICK__K_IN_G__


#if			!defined(__LOLIX__LOLI_X_CFG__K_IN_G__)
	#include	"../lolix_cfg.h"
#endif	//	!defined(__LOLIX__LOLI_X_CFG__K_IN_G__)

#if			!defined(__LOLIX__TOY_ALLOCATOR__K_IN_G__)
	#include	"./allocator.h"
#endif	//	!defined(__LOLIX__TOY_ALLOCATOR__K_IN_G__)
#if			!defined(__LOLIX__TOY__PAIR_TYPE__K_IN_G__)
	#include	"./pair_type.hpp"
#endif	//	!defined(__LOLIX__TOY__PAIR_TYPE__K_IN_G__)
#if			!defined(__LOLIX__TOY__STD_ALGORITHM__NICK__K_IN_G__)
	#include	"./std_algorithm.hpp"
#endif	//	!defined(__LOLIX__TOY__STD_ALGORITHM__NICK__K_IN_G__)
#if			!defined(__LOLIX__TOY__STD_ITERATOR__NICK__K_IN_G__)
	#include	"./std_iterator.hpp"
#endif	//	!defined(__LOLIX__TOY__STD_ITERATOR__NICK__K_IN_G__)

//#include	<functional>
//#include <iterator>

#define		__STL_CLASS_PARTIAL_SPECIALIZATION

namespace lolix{
	namespace toy{

#if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32)
#pragma set woff 1174
#pragma set woff 1375
#endif

//
#if			1
namespace _help{

template <class _Pair>
struct _Select1st
{
	typedef	_Pair	argument_type;
	typedef	typename	_Pair::first_type	result_type;
	const typename _Pair::first_type& operator()(const _Pair& __x) const
		{
		return __x.first;
		}
};


//	from stl_tree.h
typedef bool _Rb_tree_Color_type;
const _Rb_tree_Color_type _S_rb_tree_red = false;
const _Rb_tree_Color_type _S_rb_tree_black = true;

struct _Rb_tree_node_base
{
  typedef _Rb_tree_node_base* _Base_ptr;
  typedef _Rb_tree_Color_type _Color_type;

  _Base_ptr _M_parent;
  _Base_ptr _M_left;
  _Base_ptr _M_right;
  _Color_type _M_color;

  static _Base_ptr _S_minimum(_Base_ptr __x)
  {
	while (__x->_M_left != 0) __x = __x->_M_left;
	return __x;
  }

  static _Base_ptr _S_maximum(_Base_ptr __x)
  {
	while (__x->_M_right != 0) __x = __x->_M_right;
	return __x;
  }
};

template <class _Value>
struct _Rb_tree_node : public _Rb_tree_node_base
{
  typedef _Rb_tree_node<_Value>* _Link_type;
  _Value _M_value_field;
};


struct _Rb_tree_base_iterator
{
  typedef _Rb_tree_node_base::_Base_ptr _Base_ptr;
  //typedef std::bidirectional_iterator_tag iterator_category;
  typedef ptrdiff_t difference_type;
  _Base_ptr _M_node;

  void _M_increment()
  {
	if (_M_node->_M_right != 0) {
	  _M_node = _M_node->_M_right;
	  while (_M_node->_M_left != 0)
		_M_node = _M_node->_M_left;
	}
	else {
	  _Base_ptr __y = _M_node->_M_parent;
	  while (_M_node == __y->_M_right) {
		_M_node = __y;
		__y = __y->_M_parent;
	  }
	  if (_M_node->_M_right != __y)
		_M_node = __y;
	}
  }

  void _M_decrement()
  {
	if (_M_node->_M_color == _S_rb_tree_red &&
		_M_node->_M_parent->_M_parent == _M_node)
	  _M_node = _M_node->_M_right;
	else if (_M_node->_M_left != 0) {
	  _Base_ptr __y = _M_node->_M_left;
	  while (__y->_M_right != 0)
		__y = __y->_M_right;
	  _M_node = __y;
	}
	else {
	  _Base_ptr __y = _M_node->_M_parent;
	  while (_M_node == __y->_M_left) {
		_M_node = __y;
		__y = __y->_M_parent;
	  }
	  _M_node = __y;
	}
  }
};

template <class _Value, class _Ref, class _Ptr>
struct _Rb_tree_iterator : public _Rb_tree_base_iterator
{
  typedef _Value value_type;
  typedef _Ref reference;
  typedef _Ptr pointer;
  typedef _Rb_tree_iterator<_Value, _Value&, _Value*>
	iterator;
  typedef _Rb_tree_iterator<_Value, const _Value&, const _Value*>
	const_iterator;
  typedef _Rb_tree_iterator<_Value, _Ref, _Ptr>
	_Self;
  typedef _Rb_tree_node<_Value>* _Link_type;

  _Rb_tree_iterator() {}
  _Rb_tree_iterator(_Link_type __x) { _M_node = __x; }
  _Rb_tree_iterator(const iterator& __it) { _M_node = __it._M_node; }

  reference operator*() const { return _Link_type(_M_node)->_M_value_field; }
#ifndef __SGI_STL_NO_ARROW_OPERATOR
  pointer operator->() const { return &(operator*()); }
#endif /* __SGI_STL_NO_ARROW_OPERATOR */

  _Self& operator++() { _M_increment(); return *this; }
  _Self operator++(int) {
	_Self __tmp = *this;
	_M_increment();
	return __tmp;
  }

  _Self& operator--() { _M_decrement(); return *this; }
  _Self operator--(int) {
	_Self __tmp = *this;
	_M_decrement();
	return __tmp;
  }
};

inline bool operator==(const _Rb_tree_base_iterator& __x,
					   const _Rb_tree_base_iterator& __y) {
  return __x._M_node == __y._M_node;
}

inline bool operator!=(const _Rb_tree_base_iterator& __x,
					   const _Rb_tree_base_iterator& __y) {
  return __x._M_node != __y._M_node;
}

//#ifndef __STL_CLASS_PARTIAL_SPECIALIZATION
//
//inline bidirectional_iterator_tag
//iterator_category(const _Rb_tree_base_iterator&) {
//  return bidirectional_iterator_tag();
//}
//
//inline _Rb_tree_base_iterator::difference_type*
//distance_type(const _Rb_tree_base_iterator&) {
//  return (_Rb_tree_base_iterator::difference_type*) 0;
//}
//
//template <class _Value, class _Ref, class _Ptr>
//inline _Value* value_type(const _Rb_tree_iterator<_Value, _Ref, _Ptr>&) {
//  return (_Value*) 0;
//}
//
//#endif /* __STL_CLASS_PARTIAL_SPECIALIZATION */

inline void
_Rb_tree_rotate_left(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root)
{
  _Rb_tree_node_base* __y = __x->_M_right;
  __x->_M_right = __y->_M_left;
  if (__y->_M_left !=0)
	__y->_M_left->_M_parent = __x;
  __y->_M_parent = __x->_M_parent;

  if (__x == __root)
	__root = __y;
  else if (__x == __x->_M_parent->_M_left)
	__x->_M_parent->_M_left = __y;
  else
	__x->_M_parent->_M_right = __y;
  __y->_M_left = __x;
  __x->_M_parent = __y;
}

inline void
_Rb_tree_rotate_right(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root)
{
  _Rb_tree_node_base* __y = __x->_M_left;
  __x->_M_left = __y->_M_right;
  if (__y->_M_right != 0)
	__y->_M_right->_M_parent = __x;
  __y->_M_parent = __x->_M_parent;

  if (__x == __root)
	__root = __y;
  else if (__x == __x->_M_parent->_M_right)
	__x->_M_parent->_M_right = __y;
  else
	__x->_M_parent->_M_left = __y;
  __y->_M_right = __x;
  __x->_M_parent = __y;
}

inline void
_Rb_tree_rebalance(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root)
{
  __x->_M_color = _S_rb_tree_red;
  while (__x != __root && __x->_M_parent->_M_color == _S_rb_tree_red) {
	if (__x->_M_parent == __x->_M_parent->_M_parent->_M_left) {
	  _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_right;
	  if (__y && __y->_M_color == _S_rb_tree_red) {
		__x->_M_parent->_M_color = _S_rb_tree_black;
		__y->_M_color = _S_rb_tree_black;
		__x->_M_parent->_M_parent->_M_color = _S_rb_tree_red;
		__x = __x->_M_parent->_M_parent;
	  }
	  else {
		if (__x == __x->_M_parent->_M_right) {
		  __x = __x->_M_parent;
		  _Rb_tree_rotate_left(__x, __root);
		}
		__x->_M_parent->_M_color = _S_rb_tree_black;
		__x->_M_parent->_M_parent->_M_color = _S_rb_tree_red;
		_Rb_tree_rotate_right(__x->_M_parent->_M_parent, __root);
	  }
	}
	else {
	  _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_left;
	  if (__y && __y->_M_color == _S_rb_tree_red) {
		__x->_M_parent->_M_color = _S_rb_tree_black;
		__y->_M_color = _S_rb_tree_black;
		__x->_M_parent->_M_parent->_M_color = _S_rb_tree_red;
		__x = __x->_M_parent->_M_parent;
	  }
	  else {
		if (__x == __x->_M_parent->_M_left) {
		  __x = __x->_M_parent;
		  _Rb_tree_rotate_right(__x, __root);
		}
		__x->_M_parent->_M_color = _S_rb_tree_black;
		__x->_M_parent->_M_parent->_M_color = _S_rb_tree_red;
		_Rb_tree_rotate_left(__x->_M_parent->_M_parent, __root);
	  }
	}
  }
  __root->_M_color = _S_rb_tree_black;
}

inline _Rb_tree_node_base*
_Rb_tree_rebalance_for_erase(_Rb_tree_node_base* __z,
							 _Rb_tree_node_base*& __root,
							 _Rb_tree_node_base*& __leftmost,
							 _Rb_tree_node_base*& __rightmost)
{
  _Rb_tree_node_base* __y = __z;
  _Rb_tree_node_base* __x = 0;
  _Rb_tree_node_base* __x_parent = 0;
  if (__y->_M_left == 0)     // __z has at most one non-null child. y == z.
	__x = __y->_M_right;     // __x might be null.
  else
	if (__y->_M_right == 0)  // __z has exactly one non-null child. y == z.
	  __x = __y->_M_left;    // __x is not null.
	else {                   // __z has two non-null children.  Set __y to
	  __y = __y->_M_right;   //   __z's successor.  __x might be null.
	  while (__y->_M_left != 0)
		__y = __y->_M_left;
	  __x = __y->_M_right;
	}
  if (__y != __z) {          // relink y in place of z.  y is z's successor
	__z->_M_left->_M_parent = __y;
	__y->_M_left = __z->_M_left;
	if (__y != __z->_M_right) {
	  __x_parent = __y->_M_parent;
	  if (__x) __x->_M_parent = __y->_M_parent;
	  __y->_M_parent->_M_left = __x;      // __y must be a child of _M_left
	  __y->_M_right = __z->_M_right;
	  __z->_M_right->_M_parent = __y;
	}
	else
	  __x_parent = __y;
	if (__root == __z)
	  __root = __y;
	else if (__z->_M_parent->_M_left == __z)
	  __z->_M_parent->_M_left = __y;
	else
	  __z->_M_parent->_M_right = __y;
	__y->_M_parent = __z->_M_parent;
	lolix::swap(__y->_M_color, __z->_M_color);
	__y = __z;
	// __y now points to node to be actually deleted
  }
  else {                        // __y == __z
	__x_parent = __y->_M_parent;
	if (__x) __x->_M_parent = __y->_M_parent;
	if (__root == __z)
	  __root = __x;
	else
	  if (__z->_M_parent->_M_left == __z)
		__z->_M_parent->_M_left = __x;
	  else
		__z->_M_parent->_M_right = __x;
	if (__leftmost == __z)
	{
	  if (__z->_M_right == 0)        // __z->_M_left must be null also
		__leftmost = __z->_M_parent;
	// makes __leftmost == _M_header if __z == __root
	  else
		__leftmost = _Rb_tree_node_base::_S_minimum(__x);
	}

	if (__rightmost == __z)
	{
	  if (__z->_M_left == 0)         // __z->_M_right must be null also
		__rightmost = __z->_M_parent;
	// makes __rightmost == _M_header if __z == __root
	  else                      // __x == __z->_M_left
		__rightmost = _Rb_tree_node_base::_S_maximum(__x);
	}
  }
  if (__y->_M_color != _S_rb_tree_red) {
	while (__x != __root && (__x == 0 || __x->_M_color == _S_rb_tree_black))
	  if (__x == __x_parent->_M_left) {
		_Rb_tree_node_base* __w = __x_parent->_M_right;
		if (__w->_M_color == _S_rb_tree_red) {
		  __w->_M_color = _S_rb_tree_black;
		  __x_parent->_M_color = _S_rb_tree_red;
		  _Rb_tree_rotate_left(__x_parent, __root);
		  __w = __x_parent->_M_right;
		}
		if ((__w->_M_left == 0 ||
			 __w->_M_left->_M_color == _S_rb_tree_black) &&
			(__w->_M_right == 0 ||
			 __w->_M_right->_M_color == _S_rb_tree_black)) {
		  __w->_M_color = _S_rb_tree_red;
		  __x = __x_parent;
		  __x_parent = __x_parent->_M_parent;
		} else {
		  if (__w->_M_right == 0 ||
			  __w->_M_right->_M_color == _S_rb_tree_black) {
			if (__w->_M_left) __w->_M_left->_M_color = _S_rb_tree_black;
			__w->_M_color = _S_rb_tree_red;
			_Rb_tree_rotate_right(__w, __root);
			__w = __x_parent->_M_right;
		  }
		  __w->_M_color = __x_parent->_M_color;
		  __x_parent->_M_color = _S_rb_tree_black;
		  if (__w->_M_right) __w->_M_right->_M_color = _S_rb_tree_black;
		  _Rb_tree_rotate_left(__x_parent, __root);
		  break;
		}
	  } else {                  // same as above, with _M_right <-> _M_left.
		_Rb_tree_node_base* __w = __x_parent->_M_left;
		if (__w->_M_color == _S_rb_tree_red) {
		  __w->_M_color = _S_rb_tree_black;
		  __x_parent->_M_color = _S_rb_tree_red;
		  _Rb_tree_rotate_right(__x_parent, __root);
		  __w = __x_parent->_M_left;
		}
		if ((__w->_M_right == 0 ||
			 __w->_M_right->_M_color == _S_rb_tree_black) &&
			(__w->_M_left == 0 ||
			 __w->_M_left->_M_color == _S_rb_tree_black)) {
		  __w->_M_color = _S_rb_tree_red;
		  __x = __x_parent;
		  __x_parent = __x_parent->_M_parent;
		} else {
		  if (__w->_M_left == 0 ||
			  __w->_M_left->_M_color == _S_rb_tree_black) {
			if (__w->_M_right) __w->_M_right->_M_color = _S_rb_tree_black;
			__w->_M_color = _S_rb_tree_red;
			_Rb_tree_rotate_left(__w, __root);
			__w = __x_parent->_M_left;
		  }
		  __w->_M_color = __x_parent->_M_color;
		  __x_parent->_M_color = _S_rb_tree_black;
		  if (__w->_M_left) __w->_M_left->_M_color = _S_rb_tree_black;
		  _Rb_tree_rotate_right(__x_parent, __root);
		  break;
		}
	  }
	if (__x) __x->_M_color = _S_rb_tree_black;
  }
  return __y;
}

// Base class to encapsulate the differences between old SGI-style
// allocators and standard-conforming allocators.  In order to avoid
// having an empty base class, we arbitrarily move one of rb_tree's
// data members into the base class.

//namespace _help{
// _Base for general standard-conforming allocators.
template <class _Tp, typename _Alloc, bool _S_instanceless>
class _Rb_tree_alloc_base {
public:
	typedef _Alloc allocator_type;
  allocator_type get_allocator() const { return _M_node_allocator; }

  _Rb_tree_alloc_base(const allocator_type& __a)
	: _M_node_allocator(__a), _M_header(0) {}

protected:
	typename allocator_type::template rebind< _Rb_tree_node<_Tp> >::other
		   _M_node_allocator;
  _Rb_tree_node<_Tp>* _M_header;

  _Rb_tree_node<_Tp>* _M_get_node()
	{ return _M_node_allocator.allocate(1); }
  void _M_put_node(_Rb_tree_node<_Tp>* __p)
	{ _M_node_allocator.deallocate(__p, 1); }
};

// Specialization for instanceless allocators.
template <class _Tp, class _Alloc>
class _Rb_tree_alloc_base<_Tp, _Alloc, true> {
};
//public:
//	typedef typename _Alloc::rebind<_Tp>::other allocator_type;
//  allocator_type get_allocator() const { return allocator_type(); }
//
//  _Rb_tree_alloc_base(const allocator_type&) : _M_header(0) {}
//
//protected:
//  _Rb_tree_node<_Tp>* _M_header;
//
//  typedef typename _Alloc_traits<_Rb_tree_node<_Tp>, _Alloc>::_Alloc_type
//          _Alloc_type;
//
//  _Rb_tree_node<_Tp>* _M_get_node()
//    { return _Alloc_type::allocate(1); }
//  void _M_put_node(_Rb_tree_node<_Tp>* __p)
//    { _Alloc_type::deallocate(__p, 1); }
//};

template <class _Tp, class _Alloc>
struct _Rb_tree_base
  : public _Rb_tree_alloc_base<_Tp, _Alloc, false>
							   //_Alloc_traits<_Tp, _Alloc>::_S_instanceless>
{
  typedef _Rb_tree_alloc_base<_Tp, _Alloc, false>
							  //_Alloc_traits<_Tp, _Alloc>::_S_instanceless>
		  _Base;
  typedef typename _Base::allocator_type allocator_type;

  _Rb_tree_base(const allocator_type& __a)
	: _Base(__a) { this->_M_header = this->_M_get_node(); }
  ~_Rb_tree_base() { this->_M_put_node(this->_M_header); }

};


template <class _Key, class _Value, class _KeyOfValue, class _Compare,
	class _Alloc = allocator<_Value> >
class _Rb_tree : protected _Rb_tree_base<_Value, _Alloc> {
  typedef _Rb_tree_base<_Value, _Alloc> _Base;
protected:
  typedef _Rb_tree_node_base* _Base_ptr;
  typedef _Rb_tree_node<_Value> _Rb_tree_node;
  typedef _Rb_tree_Color_type _Color_type;
public:
  typedef _Key key_type;
  typedef _Value value_type;
  typedef value_type* pointer;
  typedef const value_type* const_pointer;
  typedef value_type& reference;
  typedef const value_type& const_reference;
  typedef _Rb_tree_node* _Link_type;
  typedef size_type size_type;
  typedef ptrdiff_t difference_type;

  typedef typename _Base::allocator_type allocator_type;
  allocator_type get_allocator() const { return _Base::get_allocator(); }

protected:
  using _Base::_M_get_node;
  using _Base::_M_put_node;
  using _Base::_M_header;

protected:

  _Link_type _M_create_node(const value_type& __x)
  {
	_Link_type __tmp = this->_M_get_node();
	if ( !__tmp )
	{
		__LOLIX_THROW__((void)0, throw LOLIX_CFG__STD_EXCEPT_NAME_SPACE(bad_alloc)("bad alloc exception"));
	}

	//__STL_TRY {
	//	构造不允许抛出异常才对
	new (&__tmp->_M_value_field) value_type(__x);
	//}
	//__STL_UNWIND(_M_put_node(__tmp));
	return __tmp;
  }

  _Link_type _M_clone_node(_Link_type __x)
  {
	_Link_type __tmp = _M_create_node(__x->_M_value_field);
	__tmp->_M_color = __x->_M_color;
	__tmp->_M_left = 0;
	__tmp->_M_right = 0;
	return __tmp;
  }

  //template<typename _Ty>
  //static void _Destroy_ty(_Ty* tp)
  //{ tp->~_Ty(); }
  void destroy_node(_Link_type __p)
  {
	LOLIX_DESTROY(&__p->_M_value_field);
	_M_put_node(__p);
  }

protected:
  size_type _M_node_count; // keeps track of size of tree
  _Compare _M_key_compare;

  _Link_type& _M_root() const
	{ return (_Link_type&) _M_header->_M_parent; }
  _Link_type& _M_leftmost() const
	{ return (_Link_type&) _M_header->_M_left; }
  _Link_type& _M_rightmost() const
	{ return (_Link_type&) _M_header->_M_right; }

  static _Link_type& _S_left(_Link_type __x)
	{ return (_Link_type&)(__x->_M_left); }
  static _Link_type& _S_right(_Link_type __x)
	{ return (_Link_type&)(__x->_M_right); }
  static _Link_type& _S_parent(_Link_type __x)
	{ return (_Link_type&)(__x->_M_parent); }
  static reference _S_value(_Link_type __x)
	{ return __x->_M_value_field; }
  static const _Key& _S_key(_Link_type __x)
	{ return _KeyOfValue()(_S_value(__x)); }
  static _Color_type& _S_color(_Link_type __x)
	{ return (_Color_type&)(__x->_M_color); }

  static _Link_type& _S_left(_Base_ptr __x)
	{ return (_Link_type&)(__x->_M_left); }
  static _Link_type& _S_right(_Base_ptr __x)
	{ return (_Link_type&)(__x->_M_right); }
  static _Link_type& _S_parent(_Base_ptr __x)
	{ return (_Link_type&)(__x->_M_parent); }
  static reference _S_value(_Base_ptr __x)
	{ return ((_Link_type)__x)->_M_value_field; }
  static const _Key& _S_key(_Base_ptr __x)
	{ return _KeyOfValue()(_S_value(_Link_type(__x)));}
  static _Color_type& _S_color(_Base_ptr __x)
	{ return (_Color_type&)(_Link_type(__x)->_M_color); }

  static _Link_type _S_minimum(_Link_type __x)
	{ return (_Link_type)  _Rb_tree_node_base::_S_minimum(__x); }

  static _Link_type _S_maximum(_Link_type __x)
	{ return (_Link_type) _Rb_tree_node_base::_S_maximum(__x); }

public:
  typedef _Rb_tree_iterator<value_type, reference, pointer> iterator;
  typedef _Rb_tree_iterator<value_type, const_reference, const_pointer>
		  const_iterator;

#ifdef __STL_CLASS_PARTIAL_SPECIALIZATION
  typedef lolix::toy::reverse_iterator<const_iterator> const_reverse_iterator;
  typedef lolix::toy::reverse_iterator<iterator> reverse_iterator;
#else /* __STL_CLASS_PARTIAL_SPECIALIZATION */
  typedef std::reverse_bidirectional_iterator<iterator, value_type, reference,
										 difference_type>
		  reverse_iterator;
  typedef std::reverse_bidirectional_iterator<const_iterator, value_type,
										 const_reference, difference_type>
		  const_reverse_iterator;
#endif /* __STL_CLASS_PARTIAL_SPECIALIZATION */

private:
  iterator _M_insert(_Base_ptr __x, _Base_ptr __y, const value_type& __v);
  _Link_type _M_copy(_Link_type __x, _Link_type __p);
  void _M_erase(_Link_type __x);

public:
								// allocation/deallocation
  _Rb_tree()
	: _Base(allocator_type()), _M_node_count(0), _M_key_compare()
	{ _M_empty_initialize(); }

  _Rb_tree(const _Compare& __comp)
	: _Base(allocator_type()), _M_node_count(0), _M_key_compare(__comp)
	{ _M_empty_initialize(); }

  _Rb_tree(const _Compare& __comp, const allocator_type& __a)
	: _Base(__a), _M_node_count(0), _M_key_compare(__comp)
	{ _M_empty_initialize(); }

  _Rb_tree(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x)
	: _Base(__x.get_allocator()),
	  _M_node_count(0), _M_key_compare(__x._M_key_compare)
  {
	if (__x._M_root() == 0)
	  _M_empty_initialize();
	else {
	  _S_color(_M_header) = _S_rb_tree_red;
	  _M_root() = _M_copy(__x._M_root(), _M_header);
	  _M_leftmost() = _S_minimum(_M_root());
	  _M_rightmost() = _S_maximum(_M_root());
	}
	_M_node_count = __x._M_node_count;
  }
  ~_Rb_tree() { clear(); }
  _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>&
  operator=(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x);

private:
  void _M_empty_initialize() {
	_S_color(_M_header) = _S_rb_tree_red; // used to distinguish header from
										  // __root, in iterator.operator++
	_M_root() = 0;
	_M_leftmost() = _M_header;
	_M_rightmost() = _M_header;
  }

public:
								// accessors:
  _Compare key_comp() const { return _M_key_compare; }
  iterator begin() { return _M_leftmost(); }
  const_iterator begin() const { return _M_leftmost(); }
  iterator end() { return _M_header; }
  const_iterator end() const { return _M_header; }
  reverse_iterator rbegin() { return reverse_iterator(end()); }
  const_reverse_iterator rbegin() const {
	return const_reverse_iterator(end());
  }
  reverse_iterator rend() { return reverse_iterator(begin()); }
  const_reverse_iterator rend() const {
	return const_reverse_iterator(begin());
  }
  bool empty() const { return _M_node_count == 0; }
  size_type size() const { return _M_node_count; }
  size_type max_size() const { return size_type(-1); }

  void swap(_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __t) {
	lolix::swap(_M_header, __t._M_header);
	lolix::swap(_M_node_count, __t._M_node_count);
	lolix::swap(_M_key_compare, __t._M_key_compare);
  }

public:
								// insert/erase
	lolix::toy::pair<iterator,bool> insert_unique(const value_type& __x);
  iterator insert_equal(const value_type& __x);

  iterator insert_unique(iterator __position, const value_type& __x);
  iterator insert_equal(iterator __position, const value_type& __x);

#ifdef __STL_MEMBER_TEMPLATES
  template <class _InputIterator>
  void insert_unique(_InputIterator __first, _InputIterator __last);
  template <class _InputIterator>
  void insert_equal(_InputIterator __first, _InputIterator __last);
#else /* __STL_MEMBER_TEMPLATES */
  void insert_unique(const_iterator __first, const_iterator __last);
  void insert_unique(const value_type* __first, const value_type* __last);
  void insert_equal(const_iterator __first, const_iterator __last);
  void insert_equal(const value_type* __first, const value_type* __last);
#endif /* __STL_MEMBER_TEMPLATES */

  void erase(iterator __position);
  size_type erase(const key_type& __x);
  void erase(iterator __first, iterator __last);
  void erase(const key_type* __first, const key_type* __last);
  void clear() {
	if (_M_node_count != 0) {
	  _M_erase(_M_root());
	  _M_leftmost() = _M_header;
	  _M_root() = 0;
	  _M_rightmost() = _M_header;
	  _M_node_count = 0;
	}
  }

public:
								// set operations:
  iterator find(const key_type& __x);
  const_iterator find(const key_type& __x) const;
  size_type count(const key_type& __x) const;
  iterator lower_bound(const key_type& __x);
  const_iterator lower_bound(const key_type& __x) const;
  iterator upper_bound(const key_type& __x);
  const_iterator upper_bound(const key_type& __x) const;
  pair<iterator,iterator> equal_range(const key_type& __x);
  pair<const_iterator, const_iterator> equal_range(const key_type& __x) const;

public:
								// Debugging.
  bool __rb_verify() const;
};


template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
inline bool
operator==(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x,
		   const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y)
{
  return __x.size() == __y.size() &&
		 equal(__x.begin(), __x.end(), __y.begin());
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
inline bool
operator<(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x,
		  const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y)
{
  return lexicographical_compare(__x.begin(), __x.end(),
								 __y.begin(), __y.end());
}


template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
inline bool
operator!=(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x,
		   const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y) {
  return !(__x == __y);
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
inline bool
operator>(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x,
		  const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y) {
  return __y < __x;
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
inline bool
operator<=(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x,
		   const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y) {
  return !(__y < __x);
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
inline bool
operator>=(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x,
		   const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y) {
  return !(__x < __y);
}


template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
inline void
swap(_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x,
	 _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __y)
{
  __x.swap(__y);
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>&
_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>
  ::operator=(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x)
{
  if (this != &__x) {
								// Note that _Key may be a constant type.
	clear();
	_M_node_count = 0;
	_M_key_compare = __x._M_key_compare;
	if (__x._M_root() == 0) {
	  _M_root() = 0;
	  _M_leftmost() = _M_header;
	  _M_rightmost() = _M_header;
	}
	else {
	  _M_root() = _M_copy(__x._M_root(), _M_header);
	  _M_leftmost() = _S_minimum(_M_root());
	  _M_rightmost() = _S_maximum(_M_root());
	  _M_node_count = __x._M_node_count;
	}
  }
  return *this;
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator
_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>
  ::_M_insert(_Base_ptr __x_, _Base_ptr __y_, const _Value& __v)
{
  _Link_type __x = (_Link_type) __x_;
  _Link_type __y = (_Link_type) __y_;
  _Link_type __z;

  if (__y == _M_header || __x != 0 ||
	  _M_key_compare(_KeyOfValue()(__v), _S_key(__y))) {
	__z = _M_create_node(__v);
	_S_left(__y) = __z;               // also makes _M_leftmost() = __z
									  //    when __y == _M_header
	if (__y == _M_header) {
	  _M_root() = __z;
	  _M_rightmost() = __z;
	}
	else if (__y == _M_leftmost())
	  _M_leftmost() = __z;   // maintain _M_leftmost() pointing to min node
  }
  else {
	__z = _M_create_node(__v);
	_S_right(__y) = __z;
	if (__y == _M_rightmost())
	  _M_rightmost() = __z;  // maintain _M_rightmost() pointing to max node
  }
  _S_parent(__z) = __y;
  _S_left(__z) = 0;
  _S_right(__z) = 0;
  _Rb_tree_rebalance(__z, _M_header->_M_parent);
  ++_M_node_count;
  return iterator(__z);
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator
_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>
  ::insert_equal(const _Value& __v)
{
  _Link_type __y = _M_header;
  _Link_type __x = _M_root();
  while (__x != 0) {
	__y = __x;
	__x = _M_key_compare(_KeyOfValue()(__v), _S_key(__x)) ?
			_S_left(__x) : _S_right(__x);
  }
  return _M_insert(__x, __y, __v);
}


template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
pair<typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator,
	 bool>
_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>
  ::insert_unique(const _Value& __v)
{
  _Link_type __y = _M_header;
  _Link_type __x = _M_root();
  bool __comp = true;
  while (__x != 0) {
	__y = __x;
	__comp = _M_key_compare(_KeyOfValue()(__v), _S_key(__x));
	__x = __comp ? _S_left(__x) : _S_right(__x);
  }
  iterator __j = iterator(__y);
	if (__comp)
	{
	if (__j == begin())
	  return pair<iterator,bool>(_M_insert(__x, __y, __v), true);
	else
	  --__j;
	}
  if (_M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__v)))
	return pair<iterator,bool>(_M_insert(__x, __y, __v), true);
  return pair<iterator,bool>(__j, false);
}


template <class _Key, class _Val, class _KeyOfValue,
		  class _Compare, class _Alloc>
typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>
  ::insert_unique(iterator __position, const _Val& __v)
{
  if (__position._M_node == _M_header->_M_left) { // begin()
	  if (size() > 0 &&
		_M_key_compare(_KeyOfValue()(__v), _S_key(__position._M_node)))
	  return _M_insert(__position._M_node, __position._M_node, __v);
	// first argument just needs to be non-null
	else
	  return insert_unique(__v).first;
  } else if (__position._M_node == _M_header) { // end()
	if (_M_key_compare(_S_key(_M_rightmost()), _KeyOfValue()(__v)))
	  return _M_insert(0, _M_rightmost(), __v);
	else
	  return insert_unique(__v).first;
  } else {
	iterator __before = __position;
	--__before;
	if (_M_key_compare(_S_key(__before._M_node), _KeyOfValue()(__v))
		&& _M_key_compare(_KeyOfValue()(__v), _S_key(__position._M_node))) {
	  if (_S_right(__before._M_node) == 0)
		return _M_insert(0, __before._M_node, __v);
	  else
		return _M_insert(__position._M_node, __position._M_node, __v);
	// first argument just needs to be non-null
	} else
	  return insert_unique(__v).first;
  }
}

template <class _Key, class _Val, class _KeyOfValue,
		  class _Compare, class _Alloc>
typename _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>::iterator
_Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>
  ::insert_equal(iterator __position, const _Val& __v)
{
  if (__position._M_node == _M_header->_M_left) { // begin()
	if (size() > 0 &&
		!_M_key_compare(_S_key(__position._M_node), _KeyOfValue()(__v)))
	  return _M_insert(__position._M_node, __position._M_node, __v);
	// first argument just needs to be non-null
	else
	  return insert_equal(__v);
  } else if (__position._M_node == _M_header) {// end()
	if (!_M_key_compare(_KeyOfValue()(__v), _S_key(_M_rightmost())))
	  return _M_insert(0, _M_rightmost(), __v);
	else
	  return insert_equal(__v);
  } else {
	iterator __before = __position;
	--__before;
	if (!_M_key_compare(_KeyOfValue()(__v), _S_key(__before._M_node))
		&& !_M_key_compare(_S_key(__position._M_node), _KeyOfValue()(__v))) {
	  if (_S_right(__before._M_node) == 0)
		return _M_insert(0, __before._M_node, __v);
	  else
		return _M_insert(__position._M_node, __position._M_node, __v);
	// first argument just needs to be non-null
	} else
	  return insert_equal(__v);
  }
}

#ifdef __STL_MEMBER_TEMPLATES

template <class _Key, class _Val, class _KoV, class _Cmp, class _Alloc>
  template<class _II>
void _Rb_tree<_Key,_Val,_KoV,_Cmp,_Alloc>
  ::insert_equal(_II __first, _II __last)
{
  for ( ; __first != __last; ++__first)
	insert_equal(*__first);
}

template <class _Key, class _Val, class _KoV, class _Cmp, class _Alloc>
  template<class _II>
void _Rb_tree<_Key,_Val,_KoV,_Cmp,_Alloc>
  ::insert_unique(_II __first, _II __last) {
  for ( ; __first != __last; ++__first)
	insert_unique(*__first);
}

#else /* __STL_MEMBER_TEMPLATES */

template <class _Key, class _Val, class _KoV, class _Cmp, class _Alloc>
void
_Rb_tree<_Key,_Val,_KoV,_Cmp,_Alloc>
  ::insert_equal(const _Val* __first, const _Val* __last)
{
  for ( ; __first != __last; ++__first)
	insert_equal(*__first);
}

template <class _Key, class _Val, class _KoV, class _Cmp, class _Alloc>
void
_Rb_tree<_Key,_Val,_KoV,_Cmp,_Alloc>
  ::insert_equal(const_iterator __first, const_iterator __last)
{
  for ( ; __first != __last; ++__first)
	insert_equal(*__first);
}

template <class _Key, class _Val, class _KoV, class _Cmp, class _Alloc>
void
_Rb_tree<_Key,_Val,_KoV,_Cmp,_Alloc>
  ::insert_unique(const _Val* __first, const _Val* __last)
{
  for ( ; __first != __last; ++__first)
	insert_unique(*__first);
}

template <class _Key, class _Val, class _KoV, class _Cmp, class _Alloc>
void _Rb_tree<_Key,_Val,_KoV,_Cmp,_Alloc>
  ::insert_unique(const_iterator __first, const_iterator __last)
{
  for ( ; __first != __last; ++__first)
	insert_unique(*__first);
}

#endif /* __STL_MEMBER_TEMPLATES */

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
inline void _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>
  ::erase(iterator __position)
{
  _Link_type __y =
	(_Link_type) _Rb_tree_rebalance_for_erase(__position._M_node,
											  _M_header->_M_parent,
											  _M_header->_M_left,
											  _M_header->_M_right);
  destroy_node(__y);
  --_M_node_count;
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::size_type
_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::erase(const _Key& __x)
{
  pair<iterator,iterator> __p = equal_range(__x);
  size_type __n = lolix::toy::distance(__p.first, __p.second);
  erase(__p.first, __p.second);
  return __n;
}

template <class _Key, class _Val, class _KoV, class _Compare, class _Alloc>
typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::_Link_type
_Rb_tree<_Key,_Val,_KoV,_Compare,_Alloc>
  ::_M_copy(_Link_type __x, _Link_type __p)
{
						// structural copy.  __x and __p must be non-null.
  _Link_type __top = _M_clone_node(__x);
  __top->_M_parent = __p;

  //__STL_TRY {
	if (__x->_M_right)
	  __top->_M_right = _M_copy(_S_right(__x), __top);
	__p = __top;
	__x = _S_left(__x);

	while (__x != 0) {
	  _Link_type __y = _M_clone_node(__x);
	  __p->_M_left = __y;
	  __y->_M_parent = __p;
	  if (__x->_M_right)
		__y->_M_right = _M_copy(_S_right(__x), __y);
	  __p = __y;
	  __x = _S_left(__x);
	}
  //}
  //__STL_UNWIND(_M_erase(__top));

  return __top;
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
void _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>
  ::_M_erase(_Link_type __x)
{
								// erase without rebalancing
  while (__x != 0) {
	_M_erase(_S_right(__x));
	_Link_type __y = _S_left(__x);
	destroy_node(__x);
	__x = __y;
  }
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
void _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>
  ::erase(iterator __first, iterator __last)
{
  if (__first == begin() && __last == end())
	clear();
  else
	while (__first != __last) erase(__first++);
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
void _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>
  ::erase(const _Key* __first, const _Key* __last)
{
  while (__first != __last) erase(*__first++);
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator
_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::find(const _Key& __k)
{
  _Link_type __y = _M_header;      // Last node which is not less than __k.
  _Link_type __x = _M_root();      // Current node.

  while (__x != 0)
	if (!_M_key_compare(_S_key(__x), __k))
	  __y = __x, __x = _S_left(__x);
	else
	  __x = _S_right(__x);

  iterator __j = iterator(__y);
  return (__j == end() || _M_key_compare(__k, _S_key(__j._M_node))) ?
	 end() : __j;
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::const_iterator
_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::find(const _Key& __k) const
{
  _Link_type __y = _M_header; /* Last node which is not less than __k. */
  _Link_type __x = _M_root(); /* Current node. */

  while (__x != 0) {
	if (!_M_key_compare(_S_key(__x), __k))
	  __y = __x, __x = _S_left(__x);
	else
	  __x = _S_right(__x);
  }
  const_iterator __j = const_iterator(__y);
  return (__j == end() || _M_key_compare(__k, _S_key(__j._M_node))) ?
	end() : __j;
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::size_type
_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>
  ::count(const _Key& __k) const
{
  pair<const_iterator, const_iterator> __p = equal_range(__k);
  return lolix::toy::distance(__p.first, __p.second);
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator
_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>
  ::lower_bound(const _Key& __k)
{
  _Link_type __y = _M_header; /* Last node which is not less than __k. */
  _Link_type __x = _M_root(); /* Current node. */

  while (__x != 0)
	if (!_M_key_compare(_S_key(__x), __k))
	  __y = __x, __x = _S_left(__x);
	else
	  __x = _S_right(__x);

  return iterator(__y);
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::const_iterator
_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>
  ::lower_bound(const _Key& __k) const
{
  _Link_type __y = _M_header; /* Last node which is not less than __k. */
  _Link_type __x = _M_root(); /* Current node. */

  while (__x != 0)
	if (!_M_key_compare(_S_key(__x), __k))
	  __y = __x, __x = _S_left(__x);
	else
	  __x = _S_right(__x);

  return const_iterator(__y);
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator
_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>
  ::upper_bound(const _Key& __k)
{
  _Link_type __y = _M_header; /* Last node which is greater than __k. */
  _Link_type __x = _M_root(); /* Current node. */

   while (__x != 0)
	 if (_M_key_compare(__k, _S_key(__x)))
	   __y = __x, __x = _S_left(__x);
	 else
	   __x = _S_right(__x);

   return iterator(__y);
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::const_iterator
_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>
  ::upper_bound(const _Key& __k) const
{
  _Link_type __y = _M_header; /* Last node which is greater than __k. */
  _Link_type __x = _M_root(); /* Current node. */

   while (__x != 0)
	 if (_M_key_compare(__k, _S_key(__x)))
	   __y = __x, __x = _S_left(__x);
	 else
	   __x = _S_right(__x);

   return const_iterator(__y);
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
inline
pair<typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator,
	 typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator>
_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>
  ::equal_range(const _Key& __k)
{
  return pair<iterator, iterator>(lower_bound(__k), upper_bound(__k));
}

template <class _Key, class _Value, class _KoV, class _Compare, class _Alloc>
inline
pair<typename _Rb_tree<_Key, _Value, _KoV, _Compare, _Alloc>::const_iterator,
	 typename _Rb_tree<_Key, _Value, _KoV, _Compare, _Alloc>::const_iterator>
_Rb_tree<_Key, _Value, _KoV, _Compare, _Alloc>
  ::equal_range(const _Key& __k) const
{
  return pair<const_iterator,const_iterator>(lower_bound(__k),
											 upper_bound(__k));
}

inline int
__black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root)
{
  if (__node == 0)
	return 0;
  else {
	int __bc = __node->_M_color == _S_rb_tree_black ? 1 : 0;
	if (__node == __root)
	  return __bc;
	else
	  return __bc + __black_count(__node->_M_parent, __root);
  }
}

template <class _Key, class _Value, class _KeyOfValue,
		  class _Compare, class _Alloc>
bool _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::__rb_verify() const
{
  if (_M_node_count == 0 || begin() == end())
	return _M_node_count == 0 && begin() == end() &&
	  _M_header->_M_left == _M_header && _M_header->_M_right == _M_header;

  int __len = __black_count(_M_leftmost(), _M_root());
  for (const_iterator __it = begin(); __it != end(); ++__it) {
	_Link_type __x = (_Link_type) __it._M_node;
	_Link_type __L = _S_left(__x);
	_Link_type __R = _S_right(__x);

	if (__x->_M_color == _S_rb_tree_red)
	  if ((__L && __L->_M_color == _S_rb_tree_red) ||
		  (__R && __R->_M_color == _S_rb_tree_red))
		return false;

	if (__L && _M_key_compare(_S_key(__x), _S_key(__L)))
	  return false;
	if (__R && _M_key_compare(_S_key(__R), _S_key(__x)))
	  return false;

	if (!__L && !__R && __black_count(__x, _M_root()) != __len)
	  return false;
  }

  if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))
	return false;
  if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root()))
	return false;

  return true;
}

// Class rb_tree is not part of the C++ standard.  It is provided for
// compatibility with the HP STL.

//template <class _Key, class _Value, class _KeyOfValue, class _Compare,
//          class _Alloc = __STL_DEFAULT_ALLOCATOR(_Value) >
//struct rb_tree : public _Rb_tree<_Key, _Value, _KeyOfValue, _Compare, _Alloc>
//{
//  typedef _Rb_tree<_Key, _Value, _KeyOfValue, _Compare, _Alloc> _Base;
//  typedef typename _Base::allocator_type allocator_type;
//
//  rb_tree(const _Compare& __comp = _Compare(),
//          const allocator_type& __a = allocator_type())
//    : _Base(__comp, __a) {}
//
//  ~rb_tree() {}
//};
}

#endif	//	1


#if			LOLIX_CFG__IS_DEBUG
#define __STL_CLASS_BINARY_FUNCTION_CHECK(__func, __ret, __first, __second) \
  typedef __ret (* __f_##__func##__ret##__first##__second##_binary_check)( __func&, const __first&,\
													const __second& ); \
  template <__f_##__func##__ret##__first##__second##_binary_check _Tp1> \
  struct __dummy_struct_##__func##__ret##__first##__second##_binary_check { }; \
  static __dummy_struct_##__func##__ret##__first##__second##_binary_check< \
	_STL_BINARY_FUNCTION_ERROR<__func, __ret, __first, __second>:: \
  __binary_function_requirement_violation>  \
  __dummy_ptr_##__func##__ret##__first##__second##_binary_check

#define __STL_CLASS_REQUIRES(__type_var, __concept)

template <class _Func, class _Ret, class _First, class _Second>
struct _STL_BINARY_FUNCTION_ERROR {
  static _Ret
  __binary_function_requirement_violation(_Func& __f,
										  const _First& __first,
										  const _Second& __second) {
	return __f(__first, __second);
  }
};


#else	//	LOLIX_CFG__IS_DEBUG
#define __STL_CLASS_BINARY_FUNCTION_CHECK(__func, __ret, __first, __second)
#endif	//	LOLIX_CFG__IS_DEBUG

// Forward declarations of operators == and <, needed for friend declarations.
template <class _Key, class _Tp,
			class _Compare = lolix::toy::less,
			class _Alloc = lolix::allocator<_Tp> >
class map;

template <class _Key, class _Tp, class _Compare, class _Alloc>
inline bool operator==(const map<_Key,_Tp,_Compare,_Alloc>& __x,
					   const map<_Key,_Tp,_Compare,_Alloc>& __y);

template <class _Key, class _Tp, class _Compare, class _Alloc>
inline bool operator<(const map<_Key,_Tp,_Compare,_Alloc>& __x,
					  const map<_Key,_Tp,_Compare,_Alloc>& __y);

template <class _Key, class _Tp, class _Compare, class _Alloc>
class map
{
public:

// requirements:

  __STL_CLASS_BINARY_FUNCTION_CHECK(_Compare, bool, _Key, _Key);

// typedefs:

  typedef _Key                  key_type;
  typedef _Tp                   data_type;
  typedef _Tp                   mapped_type;
  typedef pair<const _Key, _Tp> value_type;
  typedef _Compare              key_compare;

  class value_compare
  {
	  friend class map<_Key,_Tp,_Compare,_Alloc>;
  protected :
	  _Compare comp;
	  value_compare(_Compare __c) : comp(__c) {}
  public:
	  bool operator()(const value_type& __x, const value_type& __y)const
		  {
		  return comp(__x.first, __y.first);
		  }
  private:
	typedef const value_type first_argument_type;
	typedef const value_type second_argument_type;
	typedef bool	result_type;

  };

private:
	typedef _help::_Rb_tree<key_type, value_type,
		_help::_Select1st<value_type>, key_compare, _Alloc> _Rep_type;
  _Rep_type _M_t;  // red-black tree representing map
public:
  typedef typename _Rep_type::pointer pointer;
  typedef typename _Rep_type::const_pointer const_pointer;
  typedef typename _Rep_type::reference reference;
  typedef typename _Rep_type::const_reference const_reference;
  typedef typename _Rep_type::iterator iterator;
  typedef typename _Rep_type::const_iterator const_iterator;
  typedef typename _Rep_type::reverse_iterator reverse_iterator;
  typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;
  typedef typename _Rep_type::size_type size_type;
  typedef typename _Rep_type::difference_type difference_type;
  typedef typename _Rep_type::allocator_type allocator_type;

  // allocation/deallocation

  map() : _M_t(_Compare(), allocator_type()) {}
  explicit map(const _Compare& __comp,
			   const allocator_type& __a = allocator_type())
	: _M_t(__comp, __a) {}

#ifdef __STL_MEMBER_TEMPLATES
  template <class _InputIterator>
  map(_InputIterator __first, _InputIterator __last)
	: _M_t(_Compare(), allocator_type())
	{ _M_t.insert_unique(__first, __last); }

  template <class _InputIterator>
  map(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
	  const allocator_type& __a = allocator_type())
	: _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
#else
  map(const value_type* __first, const value_type* __last)
	: _M_t(_Compare(), allocator_type())
	{ _M_t.insert_unique(__first, __last); }

  map(const value_type* __first,
	  const value_type* __last, const _Compare& __comp,
	  const allocator_type& __a = allocator_type())
	: _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }

  map(const_iterator __first, const_iterator __last)
	: _M_t(_Compare(), allocator_type())
	{ _M_t.insert_unique(__first, __last); }

  map(const_iterator __first, const_iterator __last, const _Compare& __comp,
	  const allocator_type& __a = allocator_type())
	: _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }

#endif /* __STL_MEMBER_TEMPLATES */

  map(const map<_Key,_Tp,_Compare,_Alloc>& __x) : _M_t(__x._M_t) {}
  map<_Key,_Tp,_Compare,_Alloc>&
  operator=(const map<_Key, _Tp, _Compare, _Alloc>& __x)
  {
	_M_t = __x._M_t;
	return *this;
  }

  // accessors:

  key_compare key_comp() const { return _M_t.key_comp(); }
  value_compare value_comp() const { return value_compare(_M_t.key_comp()); }
  allocator_type get_allocator() const { return _M_t.get_allocator(); }

  iterator begin() { return _M_t.begin(); }
  const_iterator begin() const { return _M_t.begin(); }
  const_iterator cbegin() const { return _M_t.begin(); }
  iterator end() { return _M_t.end(); }
  const_iterator end() const { return _M_t.end(); }
  const_iterator cend() const { return _M_t.end(); }
  reverse_iterator rbegin() { return _M_t.rbegin(); }
  const_reverse_iterator rbegin() const { return _M_t.rbegin(); }
  reverse_iterator rend() { return _M_t.rend(); }
  const_reverse_iterator rend() const { return _M_t.rend(); }
  bool empty() const { return _M_t.empty(); }
  size_type size() const { return _M_t.size(); }
  size_type max_size() const { return _M_t.max_size(); }
  _Tp& operator[](const key_type& __k)
  {
	iterator __i = lower_bound(__k);
	// __i->first is greater than or equivalent to __k.
	if (__i == end() || key_comp()(__k, (*__i).first))
	  __i = insert(__i, value_type(__k, _Tp()));
	return (*__i).second;
  }
  void swap(map<_Key,_Tp,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); }

  // insert/erase

  pair<iterator,bool> insert(const value_type& __x)
	{ return _M_t.insert_unique(__x); }
  iterator insert(iterator position, const value_type& __x)
	{ return _M_t.insert_unique(position, __x); }
#ifdef __STL_MEMBER_TEMPLATES
  template <class _InputIterator>
  void insert(_InputIterator __first, _InputIterator __last) {
	_M_t.insert_unique(__first, __last);
  }
#else
  void insert(const value_type* __first, const value_type* __last) {
	_M_t.insert_unique(__first, __last);
  }
  void insert(const_iterator __first, const_iterator __last) {
	_M_t.insert_unique(__first, __last);
  }
#endif /* __STL_MEMBER_TEMPLATES */

  void erase(iterator __position) { _M_t.erase(__position); }
  size_type erase(const key_type& __x) { return _M_t.erase(__x); }
  void erase(iterator __first, iterator __last)
	{ _M_t.erase(__first, __last); }
  void clear() { _M_t.clear(); }

  // map operations:

  iterator find(const key_type& __x) { return _M_t.find(__x); }
  const_iterator find(const key_type& __x) const { return _M_t.find(__x); }
  size_type count(const key_type& __x) const {
	return _M_t.find(__x) == _M_t.end() ? 0 : 1;
  }
  iterator lower_bound(const key_type& __x) {return _M_t.lower_bound(__x); }
  const_iterator lower_bound(const key_type& __x) const {
	return _M_t.lower_bound(__x);
  }
  iterator upper_bound(const key_type& __x) {return _M_t.upper_bound(__x); }
  const_iterator upper_bound(const key_type& __x) const {
	return _M_t.upper_bound(__x);
  }

  pair<iterator,iterator> equal_range(const key_type& __x) {
	return _M_t.equal_range(__x);
  }
  pair<const_iterator,const_iterator> equal_range(const key_type& __x) const {
	return _M_t.equal_range(__x);
  }

  template <class _K1, class _T1, class _C1, class _A1>
  friend bool operator== (const map<_K1, _T1, _C1, _A1>&,
						  const map<_K1, _T1, _C1, _A1>&);
  template <class _K1, class _T1, class _C1, class _A1>
  friend bool operator< (const map<_K1, _T1, _C1, _A1>&,
						 const map<_K1, _T1, _C1, _A1>&);
};

template <class _Key, class _Tp, class _Compare, class _Alloc>
inline bool operator==(const map<_Key,_Tp,_Compare,_Alloc>& __x,
					   const map<_Key,_Tp,_Compare,_Alloc>& __y) {
  return __x._M_t == __y._M_t;
}

template <class _Key, class _Tp, class _Compare, class _Alloc>
inline bool operator<(const map<_Key,_Tp,_Compare,_Alloc>& __x,
					  const map<_Key,_Tp,_Compare,_Alloc>& __y) {
  return __x._M_t < __y._M_t;
}

#ifdef __STL_FUNCTION_TMPL_PARTIAL_ORDER

template <class _Key, class _Tp, class _Compare, class _Alloc>
inline bool operator!=(const map<_Key,_Tp,_Compare,_Alloc>& __x,
					   const map<_Key,_Tp,_Compare,_Alloc>& __y) {
  return !(__x == __y);
}

template <class _Key, class _Tp, class _Compare, class _Alloc>
inline bool operator>(const map<_Key,_Tp,_Compare,_Alloc>& __x,
					  const map<_Key,_Tp,_Compare,_Alloc>& __y) {
  return __y < __x;
}

template <class _Key, class _Tp, class _Compare, class _Alloc>
inline bool operator<=(const map<_Key,_Tp,_Compare,_Alloc>& __x,
					   const map<_Key,_Tp,_Compare,_Alloc>& __y) {
  return !(__y < __x);
}

template <class _Key, class _Tp, class _Compare, class _Alloc>
inline bool operator>=(const map<_Key,_Tp,_Compare,_Alloc>& __x,
					   const map<_Key,_Tp,_Compare,_Alloc>& __y) {
  return !(__x < __y);
}

template <class _Key, class _Tp, class _Compare, class _Alloc>
inline void swap(map<_Key,_Tp,_Compare,_Alloc>& __x,
				 map<_Key,_Tp,_Compare,_Alloc>& __y) {
  __x.swap(__y);
}

#endif /* __STL_FUNCTION_TMPL_PARTIAL_ORDER */

#if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32)
#pragma reset woff 1174
#pragma reset woff 1375
#endif

}
}

namespace lolix{
	template <class _Key, class _Tp, class _Compare, class _Alloc>
	LOLIX_INLINE_CALL void swap(toy::map<_Key, _Tp, _Compare, _Alloc>& tl, toy::map<_Key, _Tp, _Compare, _Alloc>& tr)
	{ tl.swap(tr); }
}

#endif 	//	!defined(__LOLIX__TOY__STD_MAP__NICK__K_IN_G__)
